Method for transmitting and receiving uplink control information, terminal, base station

ABSTRACT

A method for transmitting and receiving Uplink Control Information (UCI), a terminal, and a base station are provided. The transmitting method includes: calculating the number (Q′) of modulation symbols occupied by the UCI to be transmitted; dividing the information bit sequence of the UCI to be transmitted into two parts; using Reed Muller (RM) (32, 0) codes to encode each part of information bit sequence of the UCI to be transmitted to obtain a 32-bit coded bit sequence respectively, and performing rate matching so that the rate of the first 32-bit coded bit sequence ┌Q′/2┐×Q m  bits and that the rate of the second 32-bit boded bit sequence is (Q′−┌Q′/2┐)×Q m  bits; and mapping the two parts of coded bit sequences that have undergone rate matching onto a Public Uplink Shared Channel (PUSCH), and transmitting the coded bit sequences to a base station.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/344,078, filed on Nov. 4, 2016, now allowed, which is a continuationof U.S. patent application Ser. No. 14/660,476, filed on Mar. 17, 2015,now U.S. Pat. No. 9,491,745, which is a continuation of U.S. patentapplication Ser. No. 14/098,201, filed on Dec. 5, 2013, now U.S. Pat.No. 9,014,057. The U.S. patent application Ser. No. 14/098,201 is acontinuation of U.S. patent application Ser. No. 13/365,718, filed onFeb. 3, 2012, now U.S. Pat. No. 8,619,633, which is a continuation ofInternational Application No. PCT/CN2011/075504, filed on Jun. 9, 2011.The International Application No. PCT/CN2011/075504 claims priority toChinese Patent Application No. 201010556633.2, filed on Nov. 15, 2010.The afore-mentioned patent applications are hereby incorporated byreference in their entireties.

FIELD OF THE APPLICATION

The present application relates to radio communication field, and inparticular, to a method for transmitting and receiving Uplink ControlInformation (UCI), a terminal, and a base station.

BACKGROUND OF THE APPLICATION

A TDD (Time Division Duplexing) system sends and receives information onone frequency channel, but the receiving and the sending of theinformation use different time slots of one frequency carrier. The datatransmission of the downlink subframe corresponds to UCI such asresponse information, which is generally fed back through an uplinksubframe.

A LTE (Long Term Evolution) TDD system includes 7 uplink-downlinksubframe configurations. In some of uplink-downlink subframeconfigurations, the number of downlink subframes is greater than thenumber of uplink subframes, and it is possible that the UCIcorresponding to data transmission of multiple downlink subframes needto be fed back on the same uplink subframe. The UCI is generally encodedthrough RM (Reed Muller) (32, O) code before being transmitted to thebase station.

An LTE-A (Long Term Evolution Advanced) system is a further evolved andenhanced LTE system. In an LTE-A TDD system, carrier aggregation isintroduced. When a terminal accesses multiple component carrierssimultaneously, the terminal needs to feed back UCI on the same uplinkcarrier, where the UCI is UCI of multiple downlink subframes frommultiple downlink component carriers. Therefore, the bits occupied byUCI on one uplink subframe increase significantly. When the number ofbits occupied by UCI exceeds the maximum number of bits (11 bits)supported by RM (32, O) code, it is urgent to put forward a solution totransmitting UCI, which is lacking in the prior art.

SUMMARY OF THE APPLICATION

An embodiment provides a method for transmitting and receiving UCI, aterminal, and a base station to transmit UCI to resolve the problem thatthe number of occupied bits exceeds the maximum number of bits supportedby RM (32, O) code. The technical solution is as follows:

A method for transmitting UCI includes:

calculating the number Q′ of modulation symbols occupied by UCI to betransmitted;

dividing an information bit sequence of the UCI to be transmitted intotwo parts;

using RM (32, O) code to encode each part of the information bitsequence of the UCI to be transmitted to obtain a 32-bit coded bitsequence respectively, and perform rate matching for each 32-bit codedbit sequence respectively to set a first 32-bit coded bit sequence to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set asecond 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bitsequence through rate matching, where Q_(m) is modulation ordercorresponding to the UCI to be transmitted, and ┌ ┐ refers to roundingup; and

mapping the two parts of coded bit sequences that have undergone ratematching onto a Physical Uplink Shared Channel (PUSCH) and transmittingthe two parts of the coded bit sequences to a base station.

In one aspect, the mapping the two parts of coded bit sequences thathave undergone rate matching onto the PUSCH and transmitting the twoparts of the coded bit sequences to the base station includes:concatenating the two parts of coded bit sequences that have undergonerate matching to form a new bit sequence, mapping the new bit sequenceonto the PUSCH, and transmitting the new bit sequence to the basestation; or selecting alternately 4 Q_(m) coded bits in one of the twoparts of coded bit sequences that have undergone rate matching and 4Q_(m) coded bits in the other part of coded bit sequences that haveundergone rate matching to form a new bit sequence, mapping the new bitsequence onto the PUSCH, and transmitting the new bit sequence to thebase station; or selecting alternately Q_(m) coded bits in one of thetwo parts of the coded bit sequences that have undergone rate matchingand Q_(m) coded bits in the other part of the coded bit sequences thathave undergone rate matching; after 4 Q_(m) coded bits are selected,switching order of selecting alternately the two parts of coded bitsequences that have undergone rate matching, going on selecting thecoded bits alternately to form a new bit sequence, mapping the new bitsequence onto the PUSCH, and transmitting the new bit sequence to thebase station.

In another aspect, the setting the first 32-bit coded bit sequence to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes: ifa value of ┌Q′/2┐×Q_(m) is less than or equal to 32, selecting first┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence; if the valueof ┌Q′/2┐×Q_(m) is greater than 32, according to q_(i)=b_((imod32))(i=0, 1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching to set thefirst 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence,wherein q_(i) is a coded bit sequence output after the first 32-bitcoded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequencethrough rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, O_(n) is a bit in theinformation bit sequence corresponding to the first 32-bit coded bitsequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is thenumber of bits of the information bit sequence corresponding to thefirst 32-bit coded bit sequence.

In another aspect, the step of setting the second 32-bit coded bitsequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through ratematching includes: if a value of (Q′−┌Q′/2┐)×Q_(m) is less than or equalto 32, selecting first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit codedbit sequence, if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32,according to q_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)),performing rate matching to set the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bitsequence output after the second 32-bit coded bit sequence is set to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, O_(n) is a bit in theinformation bit sequence corresponding to the second 32-bit coded bitsequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is thenumber of bits of the information bit sequence corresponding to thesecond 32-bit coded bit sequence.

In another aspect, the performing rate matching for each 32-bit codedbit sequence respectively is: performing rate matching for each 32-bitcoded bit sequence respectively by circular repetition.

A method for receiving UCI includes:

receiving UCI sent by a terminal, and calculating the number Q′ ofmodulation symbols occupied by the UCI;

determining candidate control information bit sequences according to thenumber of bits of the UCI;

dividing each candidate control information bit sequence into two parts;

using RM (32, O) code to encode each part of each candidate controlinformation bit sequence to obtain a 32-bit coded bit sequencerespectively, and performing rate matching for each 32-bit coded bitsequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bitscoded bit sequence through rate matching and to set a second 32-bitcoded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence throughrate matching, where Q_(m) is modulation order corresponding to the UCI,and ┌ ┐ refers to rounding up; and

detecting the UCI by using the two parts of coded bit sequences whichcorrespond to each candidate control information bit sequence and haveundergone rate matching.

In one aspect, the detecting the Uplink Control Information by using thetwo parts of coded bit sequences which correspond to each candidatecontrol information bit sequence and have undergone rate matchingincludes: concatenating the two parts of coded bit sequences that haveundergone rate matching to form a new bit sequence, and using the newbit sequence to detect the Uplink Control Information; or selectingalternately 4 Q_(m) coded bits in one of the two parts of coded bitsequences that have undergone rate matching and 4 Q_(m) coded bits inthe other part of coded bit sequences that have undergone rate matchingto form a new bit sequence, and using the new bit sequence to detect theUCI; or selecting alternately Q_(m) coded bits in one of the two partsof the coded bit sequences that have undergone rate matching and Q_(m)coded bits in the other part of coded bit sequences that have undergonerate matching; after 4 Q_(m) coded bits are selected, switching order ofselecting alternately the two parts of coded bit sequences that haveundergone rate matching, going on selecting the coded bits alternatelyto form a new bit sequence, and using the new bit sequence to detect theUplink Control Information.

In another aspect, the setting the first 32-bit coded bit sequence to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes: ifa value of ┌Q′/2┐×Q_(m) is less than or equal to 32, selecting first┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence; and if thevalue of ┌Q′/2┐×Q_(m) is greater than 32, according toq_(i)=b_((imod32)) (i=0, 1, . . . , (┌Q′/2┐×Q_(m)−1)), performing ratematching to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bitscoded bit sequence, wherein q_(i) is a coded bit sequence output afterthe first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits codedbit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, O_(n) is a bit in theinformation bit sequence corresponding to the first 32-bit coded bitsequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is thenumber of bits of the information bit sequence corresponding to thefirst 32-bit coded bit sequence.

In another aspect, the setting the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matchingincludes: if a value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32,selecting first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bitsequence; and if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32,according to q_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)),performing rate matching to set the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bitsequence output after the second 32-bit coded bit sequence is set to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, O_(n) is a bit in theinformation bit sequence corresponding to the second 32-bit coded bitsequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is thenumber of bits of the information bit sequence corresponding to thesecond 32-bit coded bit sequence.

A terminal includes:

a calculating module, configured to calculate the number Q′ ofmodulation symbols occupied by UCI to be transmitted, and obtainmodulation order Q_(m) corresponding to the UCI to be transmitted;

a first dividing module, configured to divide an information bitsequence of the UCI to be transmitted in the calculating module into twoparts;

a first encoding module, configured to use RM (32, O) code to encodeeach part of the information bit sequence of the UCI to be transmittedto obtain a 32-bit coded bit sequence respectively, and perform ratematching for each 32-bit coded bit sequence to set a first 32-bit codedbit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through ratematching and to set a second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, whereQ_(m) is the modulation order corresponding to the UCI to betransmitted, and ┌ ┐ refers to rounding up; and

a transmitting module, configured to map the two parts of coded bitsequences that have undergone rate matching onto a Physical UplinkShared Channel (PUSCH), and transmit the two parts of the coded bitsequences to a base station.

In one aspect, the transmitting module includes at least one of thefollowing transmitting units: a first transmitting unit, configured toconcatenate the two parts of coded bit sequences that have undergonerate matching to form a new bit sequence, map the new bit sequence ontothe PUSCH, and transmit the new bit sequence to the base station; asecond transmitting unit, configured to select alternately 4 Q_(m) codedbits in one of the two parts of coded bit sequences that have undergonerate matching and 4 Q_(m) coded bits in the other part of coded bitsequences that have undergone rate matching to form a new bit sequence,map the new bit sequence onto the PUSCH, and transmit the new bitsequence to the base station; and a third transmitting unit, configuredto select alternately Q_(m) coded bits in one of the two parts of codedbit sequences that have undergone rate matching and Q_(m) coded bits inthe other part of coded bit sequences that have undergone rate matching,and, after 4 Q_(m) coded bits are selected, switch the order ofselecting alternately the two parts of coded bit sequences that haveundergone rate matching, go on selecting the coded bits alternately toform a new bit sequence, map the new bit sequence onto the PUSCH andtransmit it to the base station.

In another aspect, the first encoding module includes: a first encodingunit, configured to use Reed Muller (RM) (32, O) code to encode eachpart of information bit sequence of the UCI to be transmitted, which isdivided by the first dividing module, to obtain a 32-bit coded bitsequence respectively; a first obtaining unit, configured to obtain abit O_(n) of the information bit sequence corresponding to the first32-bit coded bit sequence obtained by the first encoding unit, a basicsequence M_(j,n) of the RM (32, O) code, and O′ being the number of bitsof the information bit sequence corresponding to the first 32-bit codedbit sequence; a first rate matching unit, configured to: select first┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence obtained by thefirst encoding unit if the value of ┌Q′/2┐×Q_(m) is less than or equalto 32, or perform rate matching for the first 32-bit coded bit sequenceto set the sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence according toq_(i)=b_((imod32)) (i=0, 1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of┌Q′/2┐×Q_(m) is greater than 32, wherein q_(i) is a coded bit sequenceoutput after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m)bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the first obtaining unit; a second obtainingunit, configured to obtain the bit O_(n) of the information bit sequencecorresponding to the second 32-bit coded bit sequence obtained by thefirst encoding unit, a basic sequence M_(j,n) of the RM (32, O) code,and O′ being the number of bits of the information bit sequencecorresponding to the second 32-bit coded bit sequence; and a second ratematching unit, configured to: select first (Q′−┌Q′/2┐)×Q_(m) bits in thesecond 32-bit coded bit sequence obtained by the first encoding unit ifthe value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32, or performrate matching for the second 32-bit coded bit sequence to set thesequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according toq_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)) if the valueof (Q′−┌′/2┐)×Q_(m) is greater than 32, wherein q_(i) is a coded bitsequence output after the second 32-bit coded bit sequence is set to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\; {mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the second obtaining unit.

A base station includes:

a receiving module, configured to receive UCI sent by a terminal,calculate the number Q′ of modulation symbols occupied by the UCI, andobtain modulation order Q_(m) corresponding to the UCI;

a determining module, configured to determine candidate controlinformation bit sequences according to the number of bits of the UCIreceived by the receiving module;

a second dividing module, configured to divide each candidate controlinformation bit sequence determined by the determining module into twoparts;

a second encoding module, configured to use RM (32, O) code to encodeeach part of each candidate control information bit sequence to obtain a32-bit coded bit sequence respectively, and perform rate matching foreach 32-bit coded bit sequence to set a first 32-bit coded bit sequenceto ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to seta second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bitsequence through rate matching, where Q_(m) is modulation ordercorresponding to the UCI, and ┌ ┐ refers to rounding up; and

a detecting module, configured to detect the UCI by using the two partsof coded bit sequences which correspond to each candidate controlinformation bit sequence and have undergone rate matching.

In one aspect, the detecting module includes at least one of thefollowing detecting units: a first detecting unit, configured toconcatenate the two parts of coded bit sequences that have undergonerate matching to form a new bit sequence, and use the new bit sequenceto detect the Uplink Control Information; a second detecting unit,configured to select alternately 4 Q_(m) coded bits in one of the twoparts of coded bit sequences that have undergone rate matching and 4Q_(m) coded bits in the other part of coded bit sequences that haveundergone rate matching to form a new bit sequence, and use the new bitsequence to detect the Uplink Control Information; and a third detectingunit, configured to select alternately Q_(m) coded bits in one of thetwo parts of coded bit sequences that have undergone rate matching andQ_(m) coded bits in the other part of coded bit sequences that haveundergone rate matching, and, after 4 Q_(m) coded bits are selected,switch the order of selecting alternately the two parts of coded bitsequences that have undergone rate matching, go on selecting the codedbits alternately to form a new bit sequence, and use the new bitsequence to detect the Uplink Control Information.

In another aspect, the second encoding module includes: a secondencoding unit, configured to use Reed Muller (RM) (32, O) code to encodeeach part of each candidate control information bit sequence to obtain a32-bit coded bit sequence respectively; a third obtaining unit,configured to obtain a bit O_(n) of the information bit sequencecorresponding to the first 32-bit coded bit sequence obtained by thesecond encoding unit, a basic sequence M_(j,n) of the RM (32, O) code,and O′ being the number of bits of the information bit sequencecorresponding to the first 32-bit coded bit sequence; a third ratematching unit, configured to: select first ┌Q′/2┐×Q_(m) bits in thefirst 32-bit coded bit sequence if the value of ┌Q′/2┐×Q_(m) is lessthan or equal to 32, or perform rate matching for the first 32-bit codedbit sequence to set the sequence to bits ┌Q′/2┐×Q_(m) bits coded bitsequence according to q_(i)=b_((imod32)) (i=0, 1, . . . ,(┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32,wherein q_(i) is a coded bit sequence output after the first 32-bitcoded bit sequence is set to ┌Q′/2┐×Q_(m) coded bit sequence throughrate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the third obtaining unit; a fourth obtainingunit, configured to obtain a bit O′ of the information bit sequencecorresponding to the second 32-bit coded bit sequence obtained by thesecond encoding unit, a basic sequence M_(j,n) of the RM (32, O) code,and O′ being the number of bits of the information bit sequencecorresponding to the second 32-bit coded bit sequence; and a fourth ratematching unit, configured to: select first (Q′−┌Q′/2┐)×Q_(m) bits in thesecond 32-bit coded bit sequence if the value of (Q′−┌Q′/2┐)×Q_(m) isless than or equal to 32, or perform rate matching for the second 32-bitcoded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits codedbit sequence according to q_(i)=b_((imod32)) (i=0, 1, . . . ,((Q′−┌Q′/2┐)×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than32, wherein q_(i) is a coded bit sequence output after the second 32-bitcoded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequencethrough rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the fourth obtaining unit.

A method for receiving UCI includes:

calculating the number Q′ of modulation symbols occupied by UCI sent bya terminal, where the UCI includes a first part of UCI and a second partof UCI; and

separating the modulation symbols of the UCI according to Q′, where thefirst part of UCI corresponds to ┌Q′/2┐ modulation symbols and thesecond part of UCI corresponds to (Q′−┌Q′/2┐) modulation symbols.

In one aspect, the ┌Q′/2┐ modulation symbols corresponding to the firstpart of UCI and the (Q′−┌Q′/2┐) modulation symbols corresponding to thesecond part of UCI are mapped to 4 SC-FDMA symbols respectively.

The technical solution brings the following benefits:

The information bit sequence of the UCI is divided into two parts, andeach part is encoded to generate a 32-bit coded bit sequencerespectively; rate matching is performed for each 32-bit coded bitsequence respectively and then the coded bit sequence is transmitted,and therefore, the UCI which occupies bits more than the maximum numberof bits supported by RM (32, O) code is transmitted properly. Moreover,each part of information bit sequence of the UCI obtains enough codinggain even if (Q′/2)×Q_(m) is greater than 24 bits, thereby improvingtransmission performance of the UCI.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of a method for transmitting UCI according toEmbodiment 1;

FIG. 2 is a schematic diagram of UCI resource mapping on each layer ofPUSCH according to Embodiment 1;

FIG. 3 is a flowchart of a method for receiving UCI according toEmbodiment 1;

FIG. 4 is a flowchart of a method for transmitting UCI according toEmbodiment 2;

FIG. 5 is a flowchart of a method for receiving UCI according toEmbodiment 2;

FIG. 6 is a flowchart of a method for transmitting UCI according toEmbodiment 3;

FIG. 7 is a schematic diagram of UCI resource mapping on each layer ofPUSCH corresponding to mode 1 according to Embodiment 3;

FIG. 8 is a schematic diagram of UCI resource mapping on each layer ofPUSCH corresponding to mode 2 according to Embodiment 3;

FIG. 9 is a schematic diagram of UCI resource mapping on each layer ofPUSCH corresponding to mode 3 according to Embodiment 3;

FIG. 10 is a flowchart of a method for receiving UCI according toEmbodiment 3;

FIG. 11 is a schematic structure diagram of a terminal according toEmbodiment 4;

FIG. 12 is a schematic structure diagram of a base station according toEmbodiment 5;

FIG. 13 is a flowchart of a method for transmitting UCI according toEmbodiment 6; and

FIG. 14 is a flowchart of a method for receiving UCI according toEmbodiment 6.

DETAILED DESCRIPTION OF THE EMBODIMENTS

To make the technical solution, objectives and merits clearer, thefollowing describes the embodiments in more detail with reference toaccompanying drawings.

Embodiment 1

As shown in FIG. 1, this embodiment provides a method for transmittingUCI. On the terminal side, the method includes the following steps:

101: Calculate the number Q′ of modulation symbols occupied by UCI to betransmitted.

If a PUSCH (Physical Uplink Share Channel) corresponds to multiplelayers, this step calculates the number of modulation symbols occupiedby the UCI on each layer of the PUSCH. The UCI may be ACK(Acknowledgment)/NACK (Negative Acknowledgement), RI (Rank Indication),or other control information. The type of the UCI is not limited herein.

Q′ is calculated through:

$\begin{matrix}{Q^{\prime} = {\min \left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH} - {initial}} \times N_{symb}^{{PUSCH} - {initial}} \times \beta_{offset}^{PUSCH}}{{\sum\limits_{r = 0}^{C^{(0)} - 1}K_{r}^{(0)}} + {\sum\limits_{r = 0}^{C^{(1)} - 1}K_{r}^{(1)}}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (1)\end{matrix}$

In the formula above, O is the number of bits of original information ofthe UCI; M_(sc) ^(PUSCH-initial) is the transmission bandwidth of thePUSCH of the same data transport block transmitted initially; M_(sc)^(PUSCH) is the transmission bandwidth of the PUSCH of the currentsubframe; N_(symb) ^(PUSCH-initial) is the number of SC-FDMA(Single-Carrier Frequency-Division Multiple Access) symbols occupied bythe same transport block transmitted initially; β_(offset) ^(PUSCH) isan offset of the UCI relative to MCS (Modulation and Coding Scheme) ofthe data, and β_(offset) ^(PUSCH)=β_(offset) ^(HARQ-ACK) when the UCI isHARQ-ACK, or β_(offset) ^(PUSCH)=β_(offset) ^(RI) when the UCI is RI,where the values of β_(offset) ^(HARQ-ACK) and β_(offset) ^(RI) aresignalled by an high layers Radio Resource Control (RRC) signaling, andare selected based on the multiple-input multiple-output (MIMO)transmission mode of the PUSCH; when the PUSCH carries two datatransport blocks, C⁽⁰⁾ is the number of code blocks generated bysegmenting the data corresponding to the first data transport block whenperforming channel coding, and C⁽¹⁾ is the number of code blocksgenerated by segmenting the data corresponding to the second datatransport block when performing channel coding; K_(r) ⁽⁰⁾ is a sum ofthe number of information bits of block r (namely, the block numbered r)of the first data transport block and the number of Cyclic RedundancyCheck (CRC) bits, and K_(r) ⁽¹⁾ is a sum of the number of informationbits of block r of the second data transport block and the number of CRCbits; and min refers to taking the minimum value, and ┌ ┐ refers torounding up.

Note that if the PUSCH corresponds to only one data transport block(namely, only one codeword exists), the Q′ may be calculated throughformula (2). Formula (2) is a result of simplifying formula (1), and themeanings of the symbols in formula (2) are the same as those in formula(1).

$\begin{matrix}{Q^{\prime} = {\min \left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH} - {initial}} \times N_{symb}^{{PUSCH} - {initial}} \times \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C - 1}K_{r}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (2)\end{matrix}$

In the formula above, C is the number of code blocks generated bydividing the data corresponding to the data transport block at the timeof channel coding; and K_(r) is the sum of the number of informationbits of block r of the data transport block and the number of CRC bits.

102: Divide the information bit sequence of the UCI to be transmittedinto two parts.

Note that in this embodiment, the information bit sequence of the UCIrefers to the original information bit sequence of the UCI. For example,if the UCI to be transmitted is ACK/NACK composed of 12 bits, theinformation bit sequence in this embodiment is one of the corresponding4096 information bit sequences, for example, 12 zeros.

This embodiment does not restrict the method of dividing the informationbit sequence of the UCI into two parts. Preferably, the dividing methodis: If the number of bits of the UCI is an even number, the informationbit sequence is divided into two equal parts; if the number of bits ofthe UCI is an odd number, the information bit sequence is divided intotwo parts, with one part being greater than the other part by one bit.

103: Use RM (32, O) code to encode each part of information bit sequenceof the UCI to obtain a 32-bit coded bit sequence respectively, andremove the 8 bits at the end to obtain a 24-bit coded bit sequence.

104: Select alternately Q_(m) coded bits in one of the 24-bit coded bitsequences and Q_(m) coded bits in the other 24-bit coded bit sequence toform a 48-bit coded bit sequence, and perform rate matching for the48-bit coded bit sequence to set the sequence to Q′×Q_(m) bits coded bitsequence.

Q_(m) above is the modulation order corresponding to the UCI to betransmitted.

105: Map the coded bit sequence that has undergone rate matching onto aPUSCH, and transmit the coded bit sequence to a base station.

FIG. 2 is a schematic diagram of UCI resource mapping on each layer ofPUSCH.

In the transmission method provided in this embodiment, the informationbit sequence of the UCI is divided into two parts, and each part isencoded by using RM (32, O) code to obtain a 32-bit coded bit sequencerespectively; and the 8 bits at the end are removed to obtain a 24-bitcoded bit sequence; a 48-bit coded bit sequence is generated byselecting alternately Q_(m) coded bits in one of the 24-bit coded bitsequences and Q_(m) coded bits in the other 24-bit coded bit sequence;and rate matching is performed for the 48-bit coded bit sequence to setthe sequence to Q′×Q_(m) bits coded bit sequence before transmission. Inthis way, the UCI is transmitted properly even if the number of bitsoccupied by the UCI exceeds the maximum number of bits supported by theRM (32, O) code.

As shown in FIG. 3, this embodiment provides a method for receiving UCI.On the base station side, the method includes the following steps:

201: Receive UCI sent by a terminal.

This step includes the following two steps:

201 a: Calculate the number Q′ of modulation symbols occupied by the UCIsent by the terminal.

This step is the same as step 101.

201 b: Separate the UCI transmitted together with the data according toQ′.

In this step, the base station separates the UCI transmitted togetherwith the data, and specifically, separates the modulation symbolscorresponding to the UCI transmitted together with the data, accordingto the number of modulation symbols occupied by the UCI in step 201 aand the resource location shown in FIG. 2, or, further according to thestep of channel deinterleaving.

202: Determine multiple candidate control information bit sequencesaccording to the number of bits of the UCI, and encode each candidatecontrol information bit sequence.

Specifically, find all the bit sequences which include bits with thenumber equivalent to the number of bits of the UCI to be detected, anduse the bit sequences as candidate control information bit sequences.For example, when the number of bits of UCI transmitted together withthe data is 12, there are 2¹² candidate control information bitsequences.

The base station encodes each candidate control information bit sequencerespectively, and the encoding includes the following steps:

202 a: Divide each candidate control information bit sequence into twoparts.

202 b: Use RM (32, O) code to encode each part of the candidate controlinformation bit sequence to obtain a 32-bit coded bit sequencerespectively, and remove the 8 bits at the end to obtain a 24-bit codedbit sequence.

202 c: Select alternately Q_(m) coded bits in one of the 24-bit codedbit sequences and Q_(m) coded bits in the other 24-bit coded bitsequence to form a 48-bit coded bit sequence, and perform rate matchingfor the 48-bit coded bit sequence to set the rate of the sequence toQ′×Q_(m) bits.

203: Detect the UCI according to the coded bit sequence that hasundergone rate matching.

The detection criteria in this step come in many types such as maximumlikelihood, and are not limited herein.

The receiving method provided in this embodiment corresponds to thetransmitting method provided in this embodiment. Through this receivingmethod, the terminal side can transmit UCI according to the transmissionmethod provided in this embodiment, and therefore, the UCI can betransmitted properly even if the number of bits occupied by the UCIexceeds the maximum number of bits supported by RM (32, O) code.

Embodiment 2

As shown in FIG. 4, this embodiment provides a method for transmittingUCI. The method includes:

301: Calculate the number Q′ of modulation symbols occupied by UCI to betransmitted.

302: Divide the information bit sequence of the UCI to be transmittedinto two parts.

303: Use RM (32, O) code to encode each part of the information bitsequence of the UCI to be transmitted to obtain a 32-bit coded bitsequence respectively, and perform rate matching for each 32-bit codedbit sequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m)bits coded bit sequence through rate matching and to set the second32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequencethrough rate matching, where Q_(m) is modulation order corresponding tothe UCI to be transmitted, and ┌ ┐ refers to rounding up.

304: Map the two parts of coded bit sequences that have undergone ratematching onto a PUSCH and transmit the two parts of the coded bitsequences to a base station.

As shown in FIG. 5, this embodiment provides a method for receiving UCI.The method includes:

401: Receive the UCI sent by the terminal, and calculate the number Q′of modulation symbols occupied by the UCI.

402: Determine candidate control information bit sequences according tothe number of bits of the UCI.

403: Divide each candidate control information bit sequence into twoparts.

404: Use RM (32, O) code to encode each part of each candidate controlinformation bit sequence to obtain a 32-bit coded bit sequencerespectively, and perform rate matching for each 32-bit coded bitsequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bitscoded bit sequence through rate matching and to set the second 32-bitcoded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence throughrate matching, where Q_(m) is modulation order corresponding to the UCI,and ┌ ┐ refers to rounding up.

405: Detect the UCI by using the two parts of coded bit sequences whichcorrespond to each candidate control information bit sequence and haveundergone rate matching.

Through the transmitting method provided in this embodiment, theinformation bit sequence of the UCI is divided into two parts, and eachpart is encoded to generate a 32-bit coded bit sequence respectively;rate matching is performed for each 32-bit coded bit sequencerespectively and then the coded bit sequence is transmitted, andtherefore, the UCI which occupies bits more than the maximum number ofbits supported by RM (32, O) code is transmitted properly. Compared withthe technical solution in Embodiment 1 above, this embodiment makes eachpart of information bit sequence of the UCI obtain enough coding gaineven if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improvingtransmission performance of the UCI.

The receiving method provided in this embodiment corresponds to thetransmitting method provided in this embodiment. Through this receivingmethod, the terminal side can transmit UCI according to the transmissionmethod provided in this embodiment, and therefore, the UCI can betransmitted properly even if the number of bits occupied by the UCIexceeds the maximum number of bits supported by RM (32, O) code.Compared with the technical solution in Embodiment 1 above, thisembodiment makes each part of information bit sequence of the UCI obtainenough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits,thereby improving transmission performance of the UCI.

Embodiment 3

As shown in FIG. 6, this embodiment provides a method for transmittingUCI. On the terminal side, the method includes the following steps:

501: Calculate the number Q′ of modulation symbols occupied by the UCIto be transmitted.

This step is the same as step 101, and is described briefly below.

If the PUSCH corresponds to multiple layers, this step calculates thenumber of modulation symbols occupied by the UCI on each layer of thePUSCH. The UCI may be ACK (Acknowledgment)/NACK (NegativeAcknowledgement), RI (Rank Indication), or other control information.The type of the UCI is not limited herein.

Q′ is calculated through:

$\begin{matrix}{Q^{\prime} = {\min \left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH} - {initial}} \times N_{symb}^{{PUSCH} - {initial}} \times \beta_{offset}^{PUSCH}}{{\sum\limits_{r = 0}^{C^{(0)} - 1}K_{r}^{(0)}} + {\sum\limits_{r = 0}^{C^{(1)} - 1}K_{r}^{(1)}}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (1)\end{matrix}$

In the formula above, O is the number of bits of original information ofthe UCI; M_(sc) ^(PUSCH-initial) is the transmission bandwidth of thePUSCH of the same data transport block transmitted initially; M_(sc)^(PUSCH) is the transmission bandwidth of the PUSCH of the currentsubframe; N_(symb) ^(PUSCH-initial) is the number of SC-FDMA(Single-Carrier Frequency-Division Multiple Access) symbols occupied bythe same transport block transmitted initially; β_(offset) ^(PUSCH) isan offset of the UCI relative to MCS (Modulation and Coding Scheme) ofthe data, and β_(offset) ^(PUSCH)=β_(offset) ^(HARQ-ACK) when the UCI isHARQ-ACK, or β_(offset) ^(PUSCH)=β_(offset) ^(RI) when the UCI is RI,where the values of β_(offset) ^(HARQ-ACK) and β_(offset) ^(RI) aresignalled by an high layers RRC signaling, and are selected based on theMIMO transmission mode of the PUSCH; when the PUSCH carries two datatransport blocks, C⁽⁰⁾ is the number of code blocks generated bysegmenting the data corresponding to the first data transport block whenperforming channel coding, and C⁽¹⁾ is the number of code blocksgenerated by segmenting the data corresponding to the second datatransport block when performing channel coding; K_(r) ⁽⁰⁾ is a sum ofthe number of information bits of block r (namely, the block numbered r)of the first data transport block and the number of CRC bits, and K_(r)⁽¹⁾ is a sum of the number of information bits of block r of the seconddata transport block and the number of CRC bits; and min refers totaking the minimum value, and ┌ ┐ refers to rounding up.

Note that if the PUSCH corresponds to only one data transport block(namely, only one codeword exists), the Q′ may be calculated throughformula (2). Formula (2) is a result of simplifying formula (1), and themeanings of the symbols in formula (2) are the same as those in formula(1).

$\begin{matrix}{Q^{\prime} = {\min \left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH} - {initial}} \times N_{symb}^{{PUSCH} - {initial}} \times \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C - 1}K_{r}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (2)\end{matrix}$

In the formula above, C is the number of code blocks generated bysegmenting the data corresponding to the data transport block whenperforming channel coding; and K_(r) is the sum of the number ofinformation bits of block r of the data transport block and the numberof CRC bits.

502: Divide the information bit sequence of the UCI to be transmittedinto two parts.

Note that in this embodiment, the information bit sequence of the UCIrefers to the original information bit sequence of the UCI. For example,if the UCI to be transmitted is ACK/NACK composed of 12 bits, theinformation bit sequence in this embodiment is one of the corresponding4096 information bit sequences, for example, 12 zeros.

This embodiment does not restrict the method of dividing the informationbit sequence of the UCI into two parts. Preferably, the dividing methodis: If the number of bits of the UCI is an even number, the informationbit sequence is divided into two equal parts; if the number of bits ofthe UCI is an odd number, the information bit sequence is divided intotwo parts, with one part being greater than the other part by one bit.

503: Use RM (32, O) code to encode each part of the information bitsequence of the UCI to obtain a 32-bit coded bit sequence respectively,and perform rate matching for each 32-bit coded bit sequence to set thefirst 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequencethrough rate matching and to set the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching.

One of the two 32-bit coded bit sequences is the first 32-bit coded bitsequence, and the other is the second 32-bit coded bit sequence.Specifically, after the rate matching, the first 32-bit coded bitsequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence, and the second32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bit coded bitsequence; or, the first 32-bit coded bit sequence is set to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, and the second 32-bit codedbit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence. If Q′ is aneven number, because ┌Q′/2┐×Q_(m)=(Q′−┌Q′/2┐)×Q_(m)=(Q′/2)×Q_(m), theforegoing process is equivalent to: performing rate matching so that thenumber of coded bits of each 32-bit coded bit sequence is (Q′/2)×Q_(m)bits.

Q_(m) is the modulation order corresponding to the UCI to betransmitted. In other words, Q_(m) is the modulation order correspondingto the data transport block multiplexed with the UCI. If the datatransport block corresponds to multiple layers, Q_(m) is also known asthe modulation order corresponding to the data on the layer which theUCI is mapped onto. The terminal is generally signalled of Q_(m) by thebase station beforehand, and therefore, the terminal and the basestation know the value of Q_(m) beforehand.

Specifically, the step of setting the first 32-bit coded bit sequence to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes:

If the value of ┌Q′/2┐×Q_(m) is less than or equal to 32 bits, selectingthe first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence;

If the value of ┌Q′/2┐×Q_(m) is greater than 32 bits, according toq_(i)=b_((imod32)) (i=0, 1, . . . , (┌Q′/2┌×Q_(m)−1)), performing ratematching to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bitscoded bit sequence, where q_(i) is the coded bit sequence output afterthe first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits codedbit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the first 32-bit coded bit sequence, O_(n) is the bit in theinformation bit sequence corresponding to the first 32-bit coded bitsequence, M_(j,n) is a basic sequence (shown in Table 1) of RM (32, O)code, and O′ is the number of bits of the information bit sequencecorresponding to the first 32-bit coded bit sequence. In this case,considering that O′ is the number of bits of the information bitsequence corresponding to the first 32-bit coded bit sequence and O_(n)is the bit in the information bit sequence corresponding to the first32-bit coded bit sequence, when n starts from 0, no bit like O_(O′)exists in the information bit sequence corresponding to the first 32-bitcoded bit sequence. In other words, no O_(O′) bit exists. Therefore, theformula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}}\mspace{11mu}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

Specifically, the setting the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matchingincludes:

If the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32 bits,selecting the first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit codedbit sequence;

If the value of (Q′−┌Q′/2∉)×Q_(m) is greater than 32 bits, according toq_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), performingrate matching to set the second 32-bit coded bit sequence to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, where q_(i) is the coded bitsequence output after the second 32-bit coded bit sequence is set to(Q′−┌Q′/2┌)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the second 32-bit coded bit sequence, O_(n) is the bit in theinformation bit sequence corresponding to the second 32-bit coded bitsequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is thenumber of bits of the information bit sequence corresponding to thesecond 32-bit coded bit sequence. In this case, considering that O′ isthe number of bits of the information bit sequence corresponding to thesecond 32-bit coded bit sequence and O_(n) is the bit in the informationbit sequence corresponding to the second 32-bit coded bit sequence, whenn starts from 0, no bit like O_(O′) exists in the information bitsequence corresponding to the second 32-bit coded bit sequence. In otherwords, no O_(O′) bit exists. Therefore, the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}}\mspace{11mu}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

TABLE 1 M_(j, 0) M_(j, 1) M_(j, 2) M_(j, 3) M_(j, 4) M_(j, 5) M_(j, 6)M_(j, 7) M_(j, 8) M_(j, 9) M_(j, 10) 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 00 0 0 0 1 1 2 1 0 0 1 0 0 1 0 1 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 00 0 1 0 0 1 5 1 1 0 0 1 0 1 1 1 0 1 6 1 0 1 0 1 0 1 0 1 1 1 7 1 0 0 1 10 0 1 1 0 1 8 1 1 0 1 1 0 0 1 0 1 1 9 1 0 1 1 1 0 1 0 0 1 1 10 1 0 1 0 01 1 1 0 1 1 11 1 1 1 0 0 1 1 0 1 0 1 12 1 0 0 1 0 1 0 1 1 1 1 13 1 1 0 10 1 0 1 0 1 1 14 1 0 0 0 1 1 0 1 0 0 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 10 1 1 1 0 0 1 0 17 1 0 0 1 1 1 0 0 1 0 0 18 1 1 0 1 1 1 1 1 0 0 0 19 1 00 0 0 1 1 0 0 0 0 20 1 0 1 0 0 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 10 0 0 1 0 0 1 1 0 1 23 1 1 1 0 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 251 1 0 0 0 1 1 1 0 0 1 26 1 0 1 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 028 1 0 1 0 1 1 1 0 1 0 0 29 1 0 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 11 31 1 0 0 0 0 0 0 0 0 0 0

Note that the rate matching method greater than 32 bits may be called acircular repetition rate matching method, or all the rate matchingmethods under each mode, including the rate matching method less than orequal to 32 bits and the rate matching method greater than 32 bits, arecollectively called “the circular repetition rate matching method”.

In this step, each part of the information bit sequence of the UCI isencoded to generate a 32-bit coded bit sequence respectively, and ratematching is performed by circular repetition for each 32-bit coded bitsequence, and therefore, compared with Embodiment 1 above, thisembodiment makes each part of information bit sequence of the UCI obtainenough coding gain when (Q′/2)×Q_(m) is greater than 24 bits, andimproves transmission performance of the UCI.

504: Apply one of the following modes to process the two parts of codedbit sequence, which are obtained in step 503 and have undergone ratematching:

Mode 1: Concatenate the two parts of coded bit sequences that haveundergone rate matching to form a new bit sequence;

Mode 2: Based on the two parts of coded bit sequences that haveundergone rate matching, generate a new bit sequence by selectingalternately 4 Q_(m) coded bits in one part and 4 Q_(m) coded bits in theother part. In other words, select 4 Q_(m) coded bits in the first32-bit coded bit sequence that has undergone rate matching, and thenselect 4 Q_(m) coded bits in the second 32-bit coded bit sequence thathas undergone rate matching, and go on selecting alternately the codedbits in the first part and the coded bits in the second part until thetwo parts of coded bit sequences that have undergone rate matching arefinished; and

Mode 3: Select alternately Q_(m) coded bits in one of the two parts ofthe coded bit sequences that have undergone rate matching and Q_(m)coded bits in the other part of coded bit sequence; after 4 Q_(m) codedbits are selected, switch the order of selecting alternately the twoparts of coded bit sequences that have undergone rate matching, and goon selecting the coded bits alternately to form a new bit sequence. Inother words, based on the two 32-bit coded bit sequences that haveundergone rate matching, select Q_(m) coded bits in the first 32-bitcoded bit sequence, and then select Q_(m) coded bits in the second32-bit coded bit sequence, and go on selecting the coded bitsalternately; after 4 Q_(m) coded bits are selected, switching theselection order, namely, select Q_(m) coded bits in the second 32-bitcoded bit sequence, and then select Q_(m) coded bits in the first 32-bitcoded bit sequence, and go on selecting the coded bits alternately;repeat the foregoing process until the two parts of coded bit sequencesthat have undergone rate matching are finished.

This step is optional. That is, step 504 may be performed or not.

505: Map the two parts of coded bit sequences of the UCI that haveundergone rate matching onto a PUSCH, and transmit the two parts of thecoded bit sequences to a base station.

If step 504 is not performed in this embodiment, the two parts of codedbit sequences, which are obtained in step 503 and have undergone ratematching, may be mapped onto the PUSCH, and transmitted to the basestation.

If step 504 is performed in this embodiment, the two parts of coded bitsequences, which are obtained in step 503 and have undergone ratematching, are processed in step 504 to generate a new bit sequence, andthe new bit sequence is mapped onto the PUSCH and transmitted to thebase station. Specifically, if mode 1 in step 504 is applied, the newbit sequence is mapped onto the PUSCH and transmitted, and the UCIresource mapping on each layer of the PUSCH is shown in FIG. 7; if mode2 in step 504 is applied, the new bit sequence is mapped onto the PUSCHand transmitted, and the UCI resource mapping on each layer of the PUSCHis shown in FIG. 8; if mode 3 in step 504 is applied, the new bitsequence is mapped onto the PUSCH and transmitted, and the UCI resourcemapping on each layer of the PUSCH is shown in FIG. 9.

In the resource mapping of the technical solution of Embodiment 1 shownin FIG. 2, the bit sequence corresponding to each part of the UCI in thetechnical solution of Embodiment 1 is mapped onto only two of the 4SC-FDMA symbols. By contrast, in this embodiment, after mode 1, mode 2or mode 3 in this embodiment is applied, the bit sequence correspondingto each part of the UCI may be mapped to 4 SC-FDMA symbols. That is, thebit sequence corresponding to each part of the UCI is distributed on thetime-frequency resources discretely, thereby achieving enough timediversity gain and frequency diversity gain and improving transmissionperformance of the UCI.

The step of mapping the two parts of coded bit sequences that haveundergone rate matching onto the PUSCH and transmitting the coded bitsequences to the base station further includes: performing channelinterleaving, scrambling, modulation, Discrete Fourier Transformation(DFT) and resource mapping for the two parts of coded bit sequences thathave undergone rate matching, data, and other UCI information such asCQI, which are then transmitted to the base station. The specificmapping method is not limited in this embodiment, and may be a method inthe prior art.

The base station receives the UCI transmitted together with the data. Asshown in FIG. 10, this embodiment provides a method for receiving UCI.The method includes the following steps:

601: Receive UCI sent by a terminal.

This step includes the following two steps:

601 a: Calculate the number Q′ of modulation symbols occupied by the UCIsent by the terminal.

If the PUSCH corresponds to multiple layers, this step calculates thenumber of modulation symbols occupied by the UCI on each layer of thePUSCH.

This step is the same as step 501.

601 b: Separate the UCI transmitted together with the data according toQ′.

In this step, the base station separates the UCI transmitted togetherwith the data, and specifically, separates the modulation symbolscorresponding to the UCI transmitted together with the data, accordingto the number of modulation symbols occupied by the UCI in step 601 a,or further according to the step of channel de-interleaving.

If step 504 is performed in this embodiment, the base station in thisstep may, according to the corresponding mode in step 504, separate themodulation symbols corresponding to each part of the coded bit sequencethat has undergone rate matching in step 503. If mode 1 in step 504 isapplied to combine the two parts of coded bit sequences that haveundergone rate matching in step 503, this step may separate themodulation symbols corresponding to each part of UCI respectivelyaccording to the resource location shown in FIG. 7; if mode 2 in step504 is applied to combine the two parts of coded bit sequences that haveundergone rate matching in step 503, this step may separate themodulation symbols corresponding to each part of UCI respectivelyaccording to the resource location shown in FIG. 8; if mode 3 in step504 is applied to combine the two parts of coded bit sequences that haveundergone rate matching in step 503, this step may separate themodulation symbols corresponding to each part of UCI respectivelyaccording to the resource location shown in FIG. 9.

602: Determine candidate control information bit sequences according tothe number of bits of the UCI to be detected, and encode each candidatecontrol information bit sequence.

Specifically, find all the bit sequences which include bits with thenumber equivalent to the number of bits of the UCI to be detected, anduse the bit sequences as candidate control information bit sequences.For example, when the number of bits of UCI transmitted together withthe data is 12, there are 2¹² candidate control information bitsequences.

The base station encodes each candidate control information bit sequencerespectively, and the encoding includes the following steps:

602 a: Divide each candidate control information bit sequence into twoparts.

This step is the same as step 502.

602 b: Use RM (32, O) code to encode each part of the candidate controlinformation bit sequence to obtain a 32-bit coded bit sequencerespectively, and perform rate matching for each 32-bit coded bitsequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bitscoded bit sequence through rate matching and to set the second 32-bitcoded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence throughrate matching, where Q_(m) is modulation order corresponding to the UCI,and ┌ ┐ refers to rounding up.

This step is the same as step 503.

602 c: In the same way as step 504, combine the two parts of coded bitsequences which are obtained in step 602 b and have undergone ratematching.

This step is optional. If step 504 is performed on the User Equipment(UE), step 602 c needs to be performed in this embodiment; if step 504is not performed on the UE, step 602 c does not need to be performed inthis embodiment.

603: Detect the UCI by using the two parts of coded bit sequences whichcorrespond to each candidate control information bit sequence and haveundergone rate matching, with a view to judging whether the candidatecontrol information bit sequence is the UCI bit sequence transmitted bythe UE.

If step 602 c is not performed in this embodiment, this step detects theUCI to be detected according to the two parts of coded bit sequenceswhich are obtained in step 602 and have undergone rate matching; if step602 c is performed in this embodiment, this step detects the UCI to bedetected according to the new bit sequence which is obtained in step602.

The detection criteria in this step come in many types. Taking themaximum likelihood detection as an example, the base station encodeseach candidate control information bit sequence according to step 602,modulates the encoded candidate control information bit sequence,conjugate-multiplies the modulated result by the modulation symbolscorresponding to the UCI separated in step 601, adds up the products toobtain a sum, and takes the real part of the sum as a likelihood value;or, the base station conjugate-multiplies the local pilot symbol by thereceived pilot symbol, adds up the products corresponding to multiplepilot symbols to obtain a first sum, adds up the products correspondingto the candidate control information to obtain a second sum, adds thefirst sum to the second sum to obtain a new sum, and takes the real partof the new sum as a likelihood value; the base station uses thecandidate control information bit sequence corresponding to the greatestlikelihood value as the UCI bit sequence transmitted by the UE.

Through the transmitting method provided in this embodiment, theinformation bit sequence of the UCI is divided into two parts, and eachpart is encoded to generate a 32-bit coded bit sequence respectively;rate matching is performed for each 32-bit coded bit sequencerespectively and then the coded bit sequence is transmitted, andtherefore, the UCI which occupies bits more than the maximum number ofbits supported by RM (32, O) code is transmitted properly. Compared withthe technical solution in Embodiment 1 above, this embodiment makes eachpart of information bit sequence of the UCI obtain enough coding gaineven if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improvingtransmission performance of the UCI.

The receiving method provided in this embodiment corresponds to thetransmitting method provided in this embodiment. Through this receivingmethod, the terminal side can transmit UCI according to the transmissionmethod provided in this embodiment, and therefore, the UCI can betransmitted properly even if the number of bits occupied by the UCIexceeds the maximum number of bits supported by RM (32, O) code.Compared with the technical solution in Embodiment 1 above, thisembodiment makes each part of information bit sequence of the UCI obtainenough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits,thereby improving transmission performance of the UCI.

Embodiment 4

As shown in FIG. 11, a terminal provided in this embodiment includes:

a calculating module 701, configured to calculate the number Q′ ofmodulation symbols occupied by UCI to be transmitted, and obtainmodulation order Q_(m) corresponding to the UCI to be transmitted;

a first dividing module 702, configured to divide an information bitsequence of the UCI to be transmitted in the calculating module 701 intotwo parts;

a first encoding module 703, configured to use RM (32, O) code to encodeeach part of the information bit sequence of the UCI to be transmitted,which is divided by the first dividing module 702, to obtain a 32-bitcoded bit sequence respectively, and perform rate matching for each32-bit coded bit sequence to set a first 32-bit coded bit sequence to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set asecond 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bitsequence through rate matching, where Q_(m) is the modulation ordercorresponding to the UCI to be transmitted, and ┌ ┐ refers to roundingup; and

a transmitting module 704, configured to map the two parts of coded bitsequences that are obtained by the first encoding module 703 and haveundergone rate matching onto a PUSCH, and transmit the two parts of thecoded bit sequences to a base station.

The transmitting module 704 includes at least one of the followingtransmitting units:

a first transmitting unit, configured to concatenate the two parts ofcoded bit sequences that are obtained by the first encoding module 703and have undergone rate matching to form a new bit sequence, map the newbit sequence onto the PUSCH, and transmit the new bit sequence to thebase station;

a second transmitting unit, configured to select alternately 4 Q_(m)coded bits in one of the two parts of coded bit sequences that areobtained by the first encoding module 703 and have undergone ratematching and 4 Q_(m) coded bits in the other part of coded bit sequenceto form a new bit sequence, map the new bit sequence onto the PUSCH, andtransmit the new bit sequence to the base station; and

a third transmitting unit, configured to select alternately 4 Q_(m)coded bits in one of the two parts of coded bit sequences that areobtained by the first encoding module 703 and have undergone ratematching and 4 Q_(m) coded bits in the other part of coded bit sequence,and, after 4 Q_(m) coded bits are selected, switch the order ofselecting alternately the two parts of coded bit sequences that areobtained by the first encoding module 703 and have undergone ratematching, go on selecting the coded bits alternately to form a new bitsequence, map the new bit sequence onto the PUSCH and transmit the newbit sequence to the base station.

The first encoding module 703 includes:

a first encoding unit, configured to use RM (32, O) code to encode eachpart of information bit sequence of the UCI to be transmitted that isdivided by the first dividing module 702 to obtain a 32-bit coded bitsequence respectively;

a first obtaining unit, configured to obtain the bit O_(n) of theinformation bit sequence corresponding to the first 32-bit coded bitsequence obtained by the first encoding unit, a basic sequence M_(j,n)of the RM (32, O) code, and O′ being the number of bits of theinformation bit sequence corresponding to the first 32-bit coded bitsequence;

a first rate matching unit, configured to: select the first ┌Q′/2┐×Q_(m)bits in the first 32-bit coded bit sequence obtained by the firstencoding unit if the value of ┌Q′/2┐×Q_(m) is less than or equal to 32bits, or perform rate matching for the first 32-bit coded bit sequenceto set the sequence to ┌Q′/2┐×Q_(n) bits coded bit sequence according toq_(i)=b_((imod32)) (i=0, 1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of┌Q′/2┐×Q_(m) is greater than 32 bits, where q_(i) is a coded bitsequence output after the first 32-bit coded bit sequence is set to┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the first obtaining unit; in this case,considering that O′ is the number of bits of the information bitsequence corresponding to the first 32-bit coded bit sequence and O_(n)is the bit in the information bit sequence corresponding to the first32-bit coded bit sequence, when n starts from 0, no bit like O_(O′)exists in the information bit sequence corresponding to the first 32-bitcoded bit sequence, namely, no O_(O′) bit exists, and therefore, theformula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}}\mspace{11mu}$

is equivalent to the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}};$

a second obtaining unit, configured to obtain the bit O_(n) of theinformation bit sequence corresponding to the second 32-bit coded bitsequence obtained by the first encoding unit, a basic sequence M_(j,n)of the RM (32, O) code, and O′ being the number of bits of theinformation bit sequence corresponding to the second 32-bit coded bitsequence; and

a second rate matching unit, configured to: select the first(Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence obtainedby the first encoding unit if the value of (Q′−┌Q′/2┐)×Q_(m) is lessthan or equal to 32 bits, or perform rate matching for the second 32-bitcoded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits codedbit sequence according to q_(i)=b_((imod32)) (i=0, 1, . . . ,((Q′−┌Q′/2┐)×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than32 bits, where q_(i) is a coded bit sequence output after the second32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bitsequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the second obtaining unit; in this case,considering that O′ is the number of bits of the information bitsequence corresponding to the second 32-bit coded bit sequence and O_(n)is the bit in the information bit sequence corresponding to the second32-bit coded bit sequence, when n starts from 0, no bit like O_(O′)exists in the information bit sequence corresponding to the second32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore,the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}}\mspace{11mu}$

is equivalent to the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}}\mspace{11mu}$

The terminal provided in this embodiment is based on the same conceptionof the terminals disclosed in Embodiment 2 and Embodiment 3 of themethods above. For the detailed implementation process of the terminal,see Embodiment 2 and Embodiment 3 of the methods above.

In this embodiment, the information bit sequence of the UCI is dividedinto two parts, and each part is encoded to generate a 32-bit coded bitsequence respectively; rate matching is performed for each 32-bit codedbit sequence respectively and then the coded bit sequence istransmitted, and therefore, the UCI which occupies bits more than themaximum number of bits supported by RM (32, O) code is transmittedproperly. Moreover, each part of information bit sequence of the UCIobtains enough coding gain even if (Q′/2)×Q_(m) is greater than 24 bits,thereby improving transmission performance of the UCI.

Embodiment 5

As shown in FIG. 12, a base station provided in this embodimentincludes:

a receiving module 801, configured to receive UCI sent by a terminal,calculate the number Q′ of modulation symbols occupied by the UCI, andobtain modulation order Q corresponding to the UCI;

a determining module 802, configured to determine candidate controlinformation bit sequences according to the number of bits of the UCIreceived by the receiving module 801;

a second dividing module 803, configured to divide each candidatecontrol information bit sequence determined by the determining module802 into two parts;

a second encoding module 804, configured to use RM (32, O) code toencode each part of each candidate control information bit sequencedivided by the second dividing module 803 to obtain a 32-bit coded bitsequence respectively, and perform rate matching for each 32-bit codedbit sequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m)bits coded bit sequence through rate matching and to set a second 32-bitcoded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence throughrate matching, where Q_(m) is modulation order corresponding to the UCI,and ┌ ┐ refers to rounding up; and

a detecting module 805, configured to detect the UCI by using the twoparts of coded bit sequences which are obtained by the second encodingmodule 804, correspond to each candidate control information bitsequence and have undergone rate matching.

The detecting module 805 includes at least one of the followingdetecting units:

a first detecting unit, configured to concatenate the two parts of codedbit sequences that are obtained by the second encoding module 804 andhave undergone rate matching to form a new bit sequence, and use the newbit sequence to detect the UCI;

a second detecting unit, configured to select alternately 4 Q_(m) codedbits in one of the two parts of coded bit sequences that that areobtained by the second encoding module 804 and have undergone ratematching and 4 Q_(m) coded bits in the other part of coded bit sequenceto form a new bit sequence, and use the new bit sequence to detect theUCI; and

a third detecting unit, configured to select alternately Q_(m) codedbits in one of the two parts of coded bit sequences that are obtained bythe second encoding module 804 and have undergone rate matching andQ_(m) coded bits in the other part of coded bit sequence, and, after 4Q_(m) coded bits are selected, switch the order of selecting alternatelythe two parts of coded bit sequences that have undergone rate matching,go on selecting the coded bits alternately to form a new bit sequence,and use the new bit sequence to detect the UCI.

The second encoding module 804 includes:

a second encoding unit, configured to use RM (32, O) code to encode eachpart of each candidate control information bit sequence divided by thesecond dividing module 803 to obtain a 32-bit coded bit sequencerespectively;

a third obtaining unit, configured to obtain the bit O_(n) of theinformation bit sequence corresponding to the first 32-bit coded bitsequence obtained by the second encoding unit, a basic sequence M_(j,n)of the RM (32, O) code, and O′ being the number of bits of theinformation bit sequence corresponding to the first 32-bit coded bitsequence;

a third rate matching unit, configured to: select the first ┌Q′/2┐×Q_(m)bits in the first 32-bit coded bit sequence if the value of ┌Q′/2┐×Q_(m)is less than or equal to 32 bits, or perform rate matching for the first32-bit coded bit sequence to set the sequence to ┌Q′/2┐×Q_(m) bits codedbit sequence according to q_(i)=b_((imod32)) (i=0, 1, . . . ,(┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32 bits,where q_(i) is a coded bit sequence output after the first 32-bit codedbit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through ratematching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the third obtaining unit; in this case,considering that O′ is the number of bits of the information bitsequence corresponding to the first 32-bit coded bit sequence andO_(n)is the bit in the information bit sequence corresponding to thefirst 32-bit coded bit sequence, when n starts from 0, no bit likeO_(O′) exists in the information bit sequence corresponding to the first32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore,the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}}\mspace{11mu}$

is equivalent to the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}};$

a fourth obtaining unit, configured to obtain the bit O_(n) of theinformation bit sequence corresponding to the second 32-bit coded bitsequence obtained by the second encoding unit, a basic sequence M_(j, n)of the RM (32, O) code, and O′ being the number of bits of theinformation bit sequence corresponding to the second 32-bit coded bitsequence; and

a fourth rate matching unit, configured to: select the first(Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence if thevalue of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32 bits, or performrate matching for the second 32-bit coded bit sequence to set thesequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according toq_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)) if the valueof (Q′−┌Q′/2┐)×Q_(m) is greater than 32 bits, where q_(i) is a coded bitsequence output after the second 32-bit coded bit sequence is set to(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ areparameters obtained by the fourth obtaining unit; in this case,considering that O′ is the number of bits of the information bitsequence corresponding to the second 32-bit coded bit sequence and O_(n)is the bit in the information bit sequence corresponding to the second32-bit coded bit sequence, when n starts from 0, no bit like O_(O′)exists in the information bit sequence corresponding to the second32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore,the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

The base station provided in this embodiment is based on the sameconception of the base stations disclosed in method embodiment 2 andmethod embodiment 3 above. For the detailed implementation process ofthe base station, see method embodiment 2 and method embodiment 3 above.

The embodiment provides a base station corresponding to the terminaltransmission method. The base station enables the terminal side totransmit UCI according to the transmission method provided in thisembodiment, and therefore, the UCI can be transmitted properly even ifthe number of bits occupied by the UCI exceeds the maximum number ofbits supported by RM (32, O) code. Moreover, each part of informationbit sequence of the UCI obtains enough coding gain even if (Q′/2)×Q_(m)is greater than 24 bits, thereby improving transmission performance ofthe UCI.

Embodiment 6

As shown in FIG. 13, this embodiment provides a method for transmittingUCI. On the terminal side, the method includes the following steps:

901: Calculate the number Q′ of modulation symbols occupied by the UCIto be transmitted.

This step is the same as step 501.

902: Divide the information bit sequence of the UCI to be transmittedinto two parts.

This step is the same as step 502.

903: Use RM (32, O) code to encode each part of information bit sequenceof the UCI to obtain a 32-bit coded bit sequence respectively.

Specifically, the calculation formula of b_(j) in Embodiment 3 may beapplied in this step. For details, see the third embodiment.

904: Apply one of the following modes to process the two 32-bit codedbit sequences obtained in step 903:

Mode 1: Concatenate the two 32-bit coded bit sequences to form a new bitsequence;

Mode 2: Select alternately Q_(m) coded bits in one of the 32-bit codedbit sequences and Q_(m) coded bits in the other 32-bit coded bitsequence to form a new 64-bit coded bit sequence;

Mode 3: Select alternately 4 Q_(m) coded bits in one of the 32-bit codedbit sequences and 4 Q_(m) coded bits in the other 32-bit coded bitsequence to form a new coded bit sequence; and

Mode 4: Select alternately Q_(m) coded bits in one of the two 32-bitcoded bit sequences and Q_(m) coded bits in the other 32-bit coded bitsequence; after 4 Q_(m) coded bits are selected, switch the order ofselecting alternately the two 32-bit coded bit sequences, and go onselecting the coded bits alternately to form a new bit sequence.

905: Perform rate matching for the new bit sequence obtained in step 904to set the new bit sequence to Q′×Q_(m) bits coded bit sequence.

Q_(m) above is the modulation order corresponding to the UCI to betransmitted.

This step may be performed in the following way:

Select the first Q′×Q_(m) bits in 64 coded bits if the value of Q′×Q_(m)is less than or equal to 64 bits, or perform circular repetitionmatching for the 64-bit coded bits to set the sequence to Q′×Q_(m) bitscoded bit sequence if the value of Q′×Q_(m) is greater than 64 bits.Specifically, the rate matching may be performed according to formula(3). For example, if the value of Q′×Q_(m) is 96, append the first 32bits in the 64 bits to the 64 bits to form 96 bits. The formula is:

q′ _(i) =b′ _((imod64)) ,i=0, 1, . . . , Q′·Q _(m)−1  (3)

In the formula above, q′_(i) is a coded bit sequence output after ratematching, j=i mod 64, and b′_(j) is the 64-bit coded bit sequenceobtained in step 904.

906: Map the coded bit sequence that has undergone rate matching in step905 onto a PUSCH, and transmit the coded bit sequence to a base station.

In the transmission method provided in this embodiment, the informationbit sequence of the UCI is divided into two parts, and each part isencoded by using RM (32, O) code to obtain a 32-bit coded bit sequencerespectively; and one of the modes specified in step 904 is applied toselect alternately coded bits in one of the two 32-bit coded bitsequences and coded bits in the other 32-bit coded bit sequence toobtain a 64-bit coded bit sequence; and rate matching is performed forthe 64-bit coded bit sequence to set the sequence to Q′×Q_(m) bits codedbit sequence, and then the sequence is transmitted. In this way, the UCIis transmitted properly even if the number of bits occupied by the UCIexceeds the maximum number of bits supported by the RM (32, O) code.

As shown in FIG. 14, this embodiment provides a method for receivingUCI. On the base station side, the method includes the following steps:

1001: Receive UCI sent by a terminal.

This step includes the following two steps:

1001 a: Calculate the number Q′ of modulation symbols occupied by theUCI sent by the terminal.

This step is the same as step 901.

1001 b: Separate the UCI transmitted together with the data according toQ′.

In this step, the base station separates the UCI transmitted togetherwith the data, and specifically, separates the modulation symbolscorresponding to the UCI transmitted together with the data, accordingto the number of modulation symbols occupied by the UCI in step 1,001 a,or further according to the step of channel de-interleaving.

1002: Determine multiple candidate control information bit sequencesaccording to the number of bits of the UCI, and encode each candidatecontrol information bit sequence.

Specifically, find all the bit sequences which include bits with thenumber equivalent to the number of bits of the UCI to be detected, anduse the bit sequences as candidate control information bit sequences.For example, when the number of bits of UCI transmitted together withthe data is 12, there are 2¹² candidate control information bitsequences.

The base station encodes each candidate control information bit sequencerespectively, and the encoding includes the following steps:

1002 a: Divide each candidate control information bit sequence into twoparts.

1002 b. Use RM (32, O) code to encode each part of the candidate controlinformation bit sequence to obtain a 32-bit coded bit sequencerespectively.

1002 c: Apply one of the following modes to process the two 32-bit codedbit sequences obtained in step 1002 b:

Mode 1: Concatenate the two 32-bit coded bit sequences to form a new bitsequence;

Mode 2: Select alternately Q_(m) coded bits in one of the 32-bit codedbit sequences and Q_(m) coded bits in the other 32-bit coded bitsequence to form a new 64-bit coded bit sequence;

Mode 3: Select alternately 4 Q_(m) coded bits in one of the 32-bit codedbit sequences and 4 Q_(m) coded bits in the other 32-bit coded bitsequence to form a new coded bit sequence; and

Mode 4: Select alternately Q_(m) coded bits in one of the two 32-bitcoded bit sequences and Q_(m) coded bits in the other 32-bit coded bitsequence; after 4 Q_(m) coded bits are selected, switch the order ofselecting alternately the two 32-bit coded bit sequences, and go onselecting the coded bits alternately to form a new bit sequence.

1002 d: Perform rate matching for the bit sequence obtained in step 1002c to set the sequence to Q′×Q_(m) bits coded bit sequence.

This step is the same as step 905.

1003: Detect the UCI according to the coded bit sequence that hasundergone rate matching.

The detection criteria in this step come in many types such as maximumlikelihood, and are not limited herein.

The receiving method provided in this embodiment corresponds to thetransmitting method provided in this embodiment. Through this receivingmethod, the terminal side can transmit UCI according to the transmissionmethod provided in this embodiment, and therefore, the UCI can betransmitted properly even if the number of bits occupied by the UCIexceeds the maximum number of bits supported by RM (32, O) code.

All or part of the contents in the technical solution provided in theforegoing embodiments may be implemented through software programming,and the software program is stored in readable storage media such as acomputer hard disk, floppy disk, or optical disk.

The above descriptions are merely exemplary embodiments, but are notintended to limit the scope of the claims. Modifications, variations orreplacement that can be easily derived based on these embodiments areunderstood to fall within the protection scope of the claims.

What is claimed is:
 1. A method for transmitting uplink controlinformation, comprising: calculating the number of modulation symbolsQ′, wherein the modulation symbols are used for uplink controlinformation that is to be transmitted; using a Reed Muller RM (32, O)code to encode a first part information bit sequence of an informationbit sequence of the uplink control information that is to be transmittedto obtain a first 32-bit coded bit sequence; using a Reed Muller RM (32,O) code to encode a second part information bit sequence of theinformation bit sequence of the uplink control information that is to betransmitted to obtain a second 32-bit coded bit sequence; performingcircular repetition for the first 32-bit coded bit sequence to set thefirst 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bitsequence; performing circular repetition for the second 32-bit coded bitsequence to set the second 32-bit coded bit sequence to a(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is a modulationorder corresponding to the uplink control information that is to betransmitted, and ┌ ┐ refers to rounding up; and transmitting the┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bitscoded bit sequence to a base station through a physical uplink sharedchannel.
 2. The method according to claim 1, wherein transmitting the┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bitscoded bit sequence through a physical uplink shared channel comprise:concatenating the ┌Q′/2┐×Q_(m) bits coded bit sequence and the(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence to form a new bit sequence;and transmitting the new bit sequence through the physical uplink sharedchannel.
 3. The method according to claim 1, wherein performing circularrepetition for the first 32-bit coded bit sequence to set the first32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequencecomprises: according to q_(i)p=b_((imod32)) (i=0, 1, . . . ,(┌Q′/2┐×Q_(m)−1)), performing circular repetition for the first 32-bitcoded bit sequence to set the first 32-bit coded bit sequence to the┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i) is the ┌Q′/2┐×Q_(m)bits coded bit sequence,$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the first 32-bit coded bit sequence, O_(n) is a bit in the firstinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the first information bit sequence.4. The method according to claim 1, wherein performing circularrepetition for the second 32-bit coded bit sequence to set the second32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequencecomprises: according to q_(i)=b_((imod32)) (i=0, 1, . . . ,((Q′−┌Q′/2┐)×Q_(m)−1)), performing circular repetition for the second32-bit coded bit sequence to set the second 32-bit coded bit sequence tothe (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is the(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the second 32-bit coded bit sequence, O_(n) is a bit in the secondinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the second information bit sequence.5. A device, comprising: a processor configured to: calculate the numberof modulation symbols Q′, wherein the modulation symbols are used foruplink control information that is to be transmitted; use a Reed Muller(RM) (32, O) code to encode a first part information bit sequence of aninformation bit sequence of the uplink control information that is to betransmitted to obtain a first 32-bit coded bit sequence; use a ReedMuller RM (32, O) code to encode a second part information bit sequenceof the information bit sequence of the uplink control information thatis to be transmitted to obtain a second 32-bit coded bit sequence;perform circular repetition for the first 32-bit coded bit sequence toset the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bitsequence; and perform circular repetition for the second 32-bit codedbit sequence to set the second 32-bit coded bit sequence to a(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is themodulation order corresponding to the uplink control information that isto be transmitted, and ┌ ┐ refers to rounding up; and control atransmitter to transmit the ┌Q′/2┐×Q_(m) bits coded bit sequence and the(Q′−┌Q′/2┐)×Q_(m) bits coded bit to a base station through a physicaluplink shared channel.
 6. The device according to claim 5, wherein theprocessor being configured to control the transmitter to transmit the┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bitscoded bit sequence through a physical uplink shared channel comprises:being configured to concatenate the ┌Q′/2┐×Q_(m) bits coded bit sequenceand the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence to form a new bitsequence, and transmit the new bit sequence through the physical uplinkshared channel.
 7. The device according to claim 5, wherein in order toperform circular repetition for the first 32-bit coded bit sequence toset the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bitsequence, the processor is configured to: perform circular repetitionfor the first 32-bit coded bit sequence to set the first 32-bit codedbit sequence to the ┌Q′/2┐×Q_(m) bits coded bit sequence according toq_(i)=b_((imod32)) (i=0, 1, . . . , (┌Q′/2┐×Q_(m)−1)), wherein q_(i) isthe ┌Q′/2┐×Q_(m) bits coded bit sequence,$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the first 32-bit coded bit sequence, O_(n) is a bit in the firstinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the first information bit sequence.8. The device according to claim 5, wherein in order to perform circularrepetition for the second 32-bit coded bit sequence to set the second32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bitsequence, the processor is configured to: perform circular repetitionfor the second 32-bit coded bit sequence to set the second 32-bit codedbit sequence to the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence accordingto q_(i)=b_((imod32)) (i=0, 1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), whereinq_(i) is the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence,$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the second 32-bit coded bit sequence, O_(n) is a bit in the secondinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the second information bit sequence.9. A computer readable medium comprising codes for causing a computerto: calculate the number of modulation symbols Q′, wherein themodulation symbols are used for uplink control information that is to betransmitted use a Reed Muller (RM) (32, O) code to encode a first partinformation bit sequence of an information bit sequence of the uplinkcontrol information that is to be transmitted to obtain a first 32-bitcoded bit sequence; use a Reed Muller RM (32, O) code to encode a secondpart information bit sequence of the information bit sequence of theuplink control information that is to be transmitted to obtain a second32-bit coded bit sequence; perform circular repetition for the first32-bit coded bit sequence to set the first 32-bit coded bit sequence toa ┌Q′/2┐×Q_(m) bits coded bit sequence; and perform circular repetitionfor the second 32-bit coded bit sequence to set the second 32-bit codedbit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, whereinQ_(m) is the modulation order corresponding to the uplink controlinformation that is to be transmitted, and ┌ ┐ refers to rounding up;and transmit the ┌Q′/2┐×Q_(m) bits coded bit sequence and the(Q′−┌Q′/2┐)×Q_(m) bits coded bit to a base station through a physicaluplink shared channel.
 10. The computer readable medium according toclaim 9, wherein the codes cause the computer to: concatenate the┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bitscoded bit sequence to form a new bit sequence; and transmit the new bitsequence through the physical uplink shared channel.
 11. The computerreadable medium according to claim 9, wherein the codes cause thecomputer to: according to q_(i)=b_((imod32)) (i=0, 1, . . . ,(┌Q′/2┐×Q_(m)−1)), perform circular repetition for the first 32-bitcoded bit sequence to set the first 32-bit coded bit sequence to the┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i) is the ┌Q′/2┐×Q_(m)bits coded bit sequence,$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the first 32-bit coded bit sequence, O_(n) is a bit in the firstinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the first information bit sequence.12. The computer readable medium according to claim 9, wherein the codescause the computer to: according to q_(i)=b_((imod32)) (i=0, 1, . . . ,((Q′−┌Q′/2┐)×Q_(m)−1)), perform circular repetition for the second32-bit coded bit sequence to set the second 32-bit coded bit sequence tothe (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is the(Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence,$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2\mspace{14mu} \left( {{j = 0},1,\ldots \mspace{11mu},31} \right)}}$is the second 32-bit coded bit sequence, O_(n) is a bit in the secondinformation bit sequence, M_(j,n) is a basic sequence of RM (32, O)code, and O′ is a number of bits of the second information bit sequence.